Plane and Boundray Extraction from Lidar Data Using Clustering and Convex Hull Projection
نویسندگان
چکیده
In this paper, we propose a new approach to extract planar patches and boundary from a set of LiDAR point cloud. In the beginning, the 3D point cloud set is partitioned and assigned to fixed-size cubes. Secondly, local planar patches are generated by extracting surface normal vectors within each cube. Finally, the global planes are formed by grouping the planar patches. The boundary of global plans is retrieved by projecting point cloud onto 2D convex hulls.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملA Novel Line Extraction Algorithm using 2D LiDAR for Ego-motion Estimation
The paper proposes a convex hull-based algorithm for rapid line extraction from 2D LiDAR datas. It uses an algorithm to calculate feature points in LiDAR data frames. Geometric features contained in these feature points provide information for subsequent matching. Compared with traditional LiDAR matching algorithms, the algorithm is greatly improved in terms of iterations and matching precision...
متن کاملShoreline Extraction from the Integration of Lidar Point Cloud Data and Aerial Orthophotos Using Mean Shift Segmentation
A method for shoreline extraction from integrated LiDAR point cloud data and aerial orthophotos is presented. First, a Mean Shift Algorithm is used for LiDAR point segmentation. The horizontal position and elevation of the LiDAR point plus color information obtained from the corresponding orthophoto are used as the point features in the Mean Shift Algorithm. Due to the homogenous nature of the ...
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملA Decidious-coniferous Single Tree Classification and Internal Structure Derivation Using Airborne Lidar Data
This project has two main purposes; the first is to perform deciduous-coniferous classification for 65 trees by using the leaf-on single flight LiDAR data. It was done by looking at the geometrical properties of the crown shapes (spherical, conical or cylindrical), these shapes were developed by a rule-driven method Lindenmayer Systems (L systems). Two more parameters that are data driven (conv...
متن کامل